Intrinsic Frequency Analysis and Fast Algorithms

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast Hybrid Algorithms for High Frequency Scattering

This paper deals with numerical methods for high frequency wave scattering. It introduces a new hybrid technique that couples a directional fast multipole method for a subsection of a scattering surface to an asymptotic formulation over the rest of the scattering domain. The directional fast multipole method is new and highly efficient for the solution of the boundary integral formulation of a ...

متن کامل

Fast Algorithms for Bayesian Independent Component Analysis

Fast algorithms for linear blind source separation are developed. The fast convergence is rst derived from low-noise approximation of the EM-algorithm given in 2], to which a modiication is made that leads as a special case to the FastICA algorithm 5]. The modii-cation is given a general interpretation and is applied to Bayesian blind source separation of noisy signals.

متن کامل

Fast Universal Algorithms for Robustness Analysis

In this paper, we develop efficient randomized algorithms for estimating probabilistic robustness margin and constructing robustness degradation curve for uncertain dynamic systems. One remarkable feature of these algorithms is their universal applicability to robustness analysis problems with arbitrary robustness requirements and uncertainty bounding set. In contrast to existing probabilistic ...

متن کامل

Frequency Domain Analysis of Adaptive Tracking Algorithms

In this paper, an analysis of the tracking performance of several adaptive algorithms is carried out for the case of model structures with fixed pole positions. Such structures have recently been proposed as an efficient generalisation of the common FIR model structure. The focus of this work is to analyse the tradeoff between noise sensitivity and tracking ability in the frequency domain by il...

متن کامل

Evaluating Performance of Algorithms in Lung IMRT: A Comparison of Monte Carlo, Pencil Beam, Superposition, Fast Superposition and Convolution Algorithms

Background: Inclusion of inhomogeneity corrections in intensity modulated small fields always makes conformal irradiation of lung tumor very complicated in accurate dose delivery.Objective: In the present study, the performance of five algorithms via Monte Carlo, Pencil Beam, Convolution, Fast Superposition and Superposition were evaluated in lung cancer Intensity Modulated Radiotherapy plannin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Scientific Reports

سال: 2018

ISSN: 2045-2322

DOI: 10.1038/s41598-018-22907-4